Ray Tracing with the Single Slab Hierarchy
نویسندگان
چکیده
Bounding volume hierarchies have become a very popular way to speed up ray tracing. In this paper we present a novel traversal and approximation scheme for bounding volume hierarchies, which is comparable in speed, has a very compact traversal algorithm and uses only 25% of the memory, compared to a standard bounding volume hierarchy.
منابع مشابه
Ray Tracing using Hierarchies of Slab Cut Balls
In this paper, bounding volume trees of slab cut balls are evaluated and compared with other types of trees for ray tracing. A novel tree construction algorithm is proposed, which utilizes a relative orientation heuristic between parent and child nodes. Also, a fast intersection test between a ray and a slab cut ball is presented. Experimental comparisons to other commonly used enclosing shapes...
متن کاملMemory efficient ray tracing with hierarchical mesh quantization
We present a lossily compressed acceleration structure for ray tracing that encodes the bounding volume hierarchy (BVH) and the triangles of a scene together in a single unified data structure. Total memory consumption of our representation is smaller than previous comparable methods by a factor of 1.7 to 4.8, and it achieves performance similar to the fastest uncompressed data structures. We s...
متن کاملWhitted Ray-Tracing for Dynamic Scenes using a Ray-Space Hierarchy on the GPU
In this paper, we present a new algorithm for interactive rendering of animated scenes with Whitted Ray-Tracing, running on the GPU. We focus our attention on the secondary rays (the rays generated by one or more bounces on specular objects), and use the GPU rasterizer for primary rays. Our algorithm is based on a ray-space hierarchy, allowing us to handle truly dynamic scenes without the need ...
متن کاملUsing Half-Precision Floating-Point Numbers for Storing Bounding Volume Hierarchies
Bounding volume hierarchies, which are commonly used to speed up ray tracing, are heavily accessed during ray traversal. Reducing the memory footprint for the bounding volume hierarchies leads to a better cache hit ratio and, therefore, faster ray tracing. This paper examines an approach of using 16-bit halfprecision floating-point numbers to store bounding volume hierarchy inner nodes. Compare...
متن کاملRay Tracing with Meta-Hierarchies
Because ray tracing acceleration techniques diier in their relative eeciency from scene to scene, no single technique can be optimal in all circumstances. This has lead researchers to develop hybrid algorithms that combine two or more distinct techniques into one. In this paper we describe a generalization of this idea, the meta-hierarchy, which arises from a procedural encapsulation of acceler...
متن کامل